A Computable Fourier Condition Generating Alias-Free Sampling Lattices
نویسندگان
چکیده
منابع مشابه
Computable Fourier Conditions for Alias-Free Sampling and Critical Sampling
We propose a Fourier analytical approach to the problems of alias-free sampling and critical sampling. Central to this approach are two Fourier conditions linking the above sampling criteria with the Fourier transform of the indicator function defined on the underlying frequency support. We present several examples to demonstrate the usefulness of the proposed Fourier conditions in the design o...
متن کاملInterband Alias-Free Subband Adaptive Filtering with Critical Sampling
Adaptive Filtering is an important concept in the field of signal processing and has numerous applications in fields such as speech processing and communications. An Adaptive filter is a filter that self-adjusts its transfer function according to an optimizing algorithm. Because of the complexity of the optimizing algorithms, most adaptive filters are digital filters that perform digital signal...
متن کاملTowards Alias-Free Pointers
This paper argues that pointer-induced aliasing can be avoided in many cases by means of a concept of unique pointer. The use of such pointers is expected to fortify the concept of encapsulation, to make systems easier to reason about, to provide better control over the interaction between threads, and to make storage management safer and more ef-cient. We show that unique pointers can be imple...
متن کاملAlias-Free Shadow Maps
In this paper we abandon the regular structure of shadow maps. Instead, we transform the visible pixels P(x,y,z) from screen space to the image plane of a light source P′(x′,y′,z′). The (x′,y′) are then used as sampling points when the geometry is rasterized into the shadow map. This eliminates the resolution issues that have plagued shadow maps for decades, e.g., jagged shadow boundaries. Inco...
متن کاملSampling on Lattices with Free Boundary Conditions Using Randomized Extensions
Many statistical physics models are defined on an infinite lattice by taking appropriate limits of finite lattice regions, where a key consideration is how the boundaries are defined. For several models on planar lattices, such as 3-colorings and lozenge tilings, efficient sampling algorithms are known for regions with fixed boundary conditions, where the colors or tiles around the boundary are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2009
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2009.2013904